extremal programming

extremal programming
ekstremalusis programavimas statusas T sritis informatika apibrėžtis Programavimo technologija, kai drauge dirba nedidelė grupė aukštos kvalifikacijos programuotojų, bet kada galinčių pakeisti vienas kitą; vadovaujasi nesudėtingomis, visiems suprantamomis taisyklėmis. Programuotojų skaičius grupėje 2–10. Visi dirba intensyviai, nuolat bendraudami tarpusavyje ir su užsakovu. Gerai tinka, kai reikalavimai programinei įrangai nuolat keičiasi, kai reikalingi netradiciniai, rizikingi sprendimai. atitikmenys: angl. extremal programming; XP programming

Enciklopedinis kompiuterijos žodynas . . 2008.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • XP programming — ekstremalusis programavimas statusas T sritis informatika apibrėžtis Programavimo technologija, kai drauge dirba nedidelė grupė aukštos kvalifikacijos programuotojų, bet kada galinčių pakeisti vienas kitą; vadovaujasi nesudėtingomis, visiems… …   Enciklopedinis kompiuterijos žodynas

  • Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… …   Wikipedia

  • Naum Z. Shor — Naum Zuselevich Shor Born 1 January 1937(1937 01 01) Kiev, Ukraine, USSR Died 26 February 2006(2006 02 26 …   Wikipedia

  • ekstremalusis programavimas — statusas T sritis informatika apibrėžtis Programavimo technologija, kai drauge dirba nedidelė grupė aukštos kvalifikacijos programuotojų, bet kada galinčių pakeisti vienas kitą; vadovaujasi nesudėtingomis, visiems suprantamomis taisyklėmis.… …   Enciklopedinis kompiuterijos žodynas

  • combinatorics — /keuhm buy neuh tawr iks, tor , kom beuh /, n. (used with singular v.) See combinatorial analysis. * * * Branch of mathematics concerned with the selection, arrangement, and combination of objects chosen from a finite set. The number of possible… …   Universalium

  • Möbius ladder — Two views of the Möbius ladder M16. In graph theory, the Möbius ladder Mn is a cubic circulant graph with an even number n of vertices, formed from an n cycle by adding edges (called rungs ) connecting opposite pairs of vertices in the cycle. It… …   Wikipedia

  • Criss-cross algorithm — This article is about an algorithm for mathematical optimization. For the naming of chemicals, see crisscross method. The criss cross algorithm visits all 8 corners of the Klee–Minty cube in the worst case. It visits 3 additional… …   Wikipedia

  • Genetic algorithm — A genetic algorithm (GA) is a search heuristic that mimics the process of natural evolution. This heuristic is routinely used to generate useful solutions to optimization and search problems. Genetic algorithms belong to the larger class of… …   Wikipedia

  • List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra …   Wikipedia

  • List of mathematics articles (E) — NOTOC E E₇ E (mathematical constant) E function E₈ lattice E₈ manifold E∞ operad E7½ E8 investigation tool Earley parser Early stopping Earnshaw s theorem Earth mover s distance East Journal on Approximations Eastern Arabic numerals Easton s… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”